Arbitrary elementary landscapes & AR(1) processes
نویسندگان
چکیده
منابع مشابه
Arbitrary elementary landscapes & AR(1) processes
Neighborhood specification is a dominant consideration in assuring the success of a direct search approach to a difficult combinatorial optimization problem. Previous research has shown the efficacy of imposing an elementary landscape upon the search topology. Barnes et al. [J.W. Barnes, S. Dokov, B. Dimova, A. Solomon, A theory of elementary landscapes, Applied Mathematics Letters 16 (2003)] g...
متن کاملQuasi-elementary Landscapes and Superpositions of Elementary Landscapes
There exist local search landscapes where the evaluation function is an eigenfunction of the graph Laplacian that corresponds to the neighborhood structure of the search space. Problems that display this structure are called “Elementary Landscapes” and they have a number of special mathematical properties. The term “Quasi-elementary landscapes” is introduced to describe landscapes that are “alm...
متن کاملAn Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes
We present an elementary algorithm for deciding bisimulation equivalence between arbitrary context-free processes. This improves on the state of the art algorithm of Christensen, H uttel and Stirling consisting of two semi-decision procedures running in parallel, which prohibits any complexity estimation. The point of our algorithm is the eeective construction of a nite relation characterizing ...
متن کاملThe theory of elementary landscapes
When joined to a stipulated neighborhood digraph, an objective function deÞned on the solution space of a real combinatorial optimization problem forms a landscape. Grover shows that landscapes satisfying a certain difference equation have properties favorable to local search. Studying only symmetric and regular neighborhood digraphs, Stadler deÞnes elementary landscapes as those which can be r...
متن کامل2-bit Flip Mutation Elementary Fitness Landscapes
Genetic Programming parity with only XOR is not elementary. GP parity can be represented as the sum of k/2 + 1 elementary landscapes. Statistics, including fitness distance correlation (FDC), of Parity’s fitness landscape are calculated. Using Walsh analysis the eigen values and eigenvectors of the Laplacian of the two bit flip fitness landscape are given. Tests support λ/d as a measure of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2005
ISSN: 0893-9659
DOI: 10.1016/j.aml.2004.09.006